<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>XenC: include/kenlm/util/double-conversion/cached-powers.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">XenC
   &#160;<span id="projectnumber">1.0</span>
   </div>
   <div id="projectbrief">Open-source tool for data selection in NLP</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_5417fc49d29c4cfca6bc3f52c9c7deba.html">kenlm</a></li><li class="navelem"><a class="el" href="dir_9ec25de6763e2dc47109730f881b7e3e.html">util</a></li><li class="navelem"><a class="el" href="dir_5fd0dc67f55ed56e6f450361f3921d3b.html">double-conversion</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">cached-powers.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="cached-powers_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">// Copyright 2010 the V8 project authors. All rights reserved.</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">// Redistribution and use in source and binary forms, with or without</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">// modification, are permitted provided that the following conditions are</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">// met:</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">//     * Redistributions of source code must retain the above copyright</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment">//       notice, this list of conditions and the following disclaimer.</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">//     * Redistributions in binary form must reproduce the above</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">//       copyright notice, this list of conditions and the following</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">//       disclaimer in the documentation and/or other materials provided</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">//       with the distribution.</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">//     * Neither the name of Google Inc. nor the names of its</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">//       contributors may be used to endorse or promote products derived</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">//       from this software without specific prior written permission.</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment">// &quot;AS IS&quot; AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment">// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="comment">// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment">// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="comment">// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="comment">// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment">// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="preprocessor">#ifndef DOUBLE_CONVERSION_CACHED_POWERS_H_</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="preprocessor">#define DOUBLE_CONVERSION_CACHED_POWERS_H_</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="diy-fp_8h.html">diy-fp.h</a>&quot;</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespacedouble__conversion.html">double_conversion</a> {</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;</div><div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="classdouble__conversion_1_1_powers_of_ten_cache.html">   35</a></span>&#160;<span class="keyword">class </span><a class="code" href="classdouble__conversion_1_1_powers_of_ten_cache.html">PowersOfTenCache</a> {</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160; <span class="keyword">public</span>:</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;  <span class="comment">// Not all powers of ten are cached. The decimal exponent of two neighboring</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;  <span class="comment">// cached numbers will differ by kDecimalExponentDistance.</span></div><div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="classdouble__conversion_1_1_powers_of_ten_cache.html#a3ecbb3a97d25287eabbff08d104aebf8">   40</a></span>&#160;  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="classdouble__conversion_1_1_powers_of_ten_cache.html#a3ecbb3a97d25287eabbff08d104aebf8">kDecimalExponentDistance</a>;</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div><div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="classdouble__conversion_1_1_powers_of_ten_cache.html#a57195696e2342fcbc36f4fbbd4f21207">   42</a></span>&#160;  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="classdouble__conversion_1_1_powers_of_ten_cache.html#a57195696e2342fcbc36f4fbbd4f21207">kMinDecimalExponent</a>;</div><div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="classdouble__conversion_1_1_powers_of_ten_cache.html#ae794e0556fa191e9c7c3bb87e2fd49ba">   43</a></span>&#160;  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="classdouble__conversion_1_1_powers_of_ten_cache.html#ae794e0556fa191e9c7c3bb87e2fd49ba">kMaxDecimalExponent</a>;</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;  <span class="comment">// Returns a cached power-of-ten with a binary exponent in the range</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;  <span class="comment">// [min_exponent; max_exponent] (boundaries included).</span></div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;  <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classdouble__conversion_1_1_powers_of_ten_cache.html#a5cdcb238a9b7615f550dd78d616b3c2e">GetCachedPowerForBinaryExponentRange</a>(<span class="keywordtype">int</span> min_exponent,</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;                                                   <span class="keywordtype">int</span> max_exponent,</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;                                                   <a class="code" href="classdouble__conversion_1_1_diy_fp.html">DiyFp</a>* power,</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;                                                   <span class="keywordtype">int</span>* decimal_exponent);</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;  <span class="comment">// Returns a cached power of ten x ~= 10^k such that</span></div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;  <span class="comment">//   k &lt;= decimal_exponent &lt; k + kCachedPowersDecimalDistance.</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;  <span class="comment">// The given decimal_exponent must satisfy</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;  <span class="comment">//   kMinDecimalExponent &lt;= requested_exponent, and</span></div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;  <span class="comment">//   requested_exponent &lt; kMaxDecimalExponent + kDecimalExponentDistance.</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;  <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classdouble__conversion_1_1_powers_of_ten_cache.html#aaf9667534da2d5439e04748010e357ab">GetCachedPowerForDecimalExponent</a>(<span class="keywordtype">int</span> requested_exponent,</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;                                               <a class="code" href="classdouble__conversion_1_1_diy_fp.html">DiyFp</a>* power,</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;                                               <span class="keywordtype">int</span>* found_exponent);</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;};</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;}  <span class="comment">// namespace double_conversion</span></div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="preprocessor">#endif  // DOUBLE_CONVERSION_CACHED_POWERS_H_</span></div><div class="ttc" id="classdouble__conversion_1_1_diy_fp_html"><div class="ttname"><a href="classdouble__conversion_1_1_diy_fp.html">double_conversion::DiyFp</a></div><div class="ttdef"><b>Definition:</b> diy-fp.h:40</div></div>
<div class="ttc" id="classdouble__conversion_1_1_powers_of_ten_cache_html_ae794e0556fa191e9c7c3bb87e2fd49ba"><div class="ttname"><a href="classdouble__conversion_1_1_powers_of_ten_cache.html#ae794e0556fa191e9c7c3bb87e2fd49ba">double_conversion::PowersOfTenCache::kMaxDecimalExponent</a></div><div class="ttdeci">static const int kMaxDecimalExponent</div><div class="ttdef"><b>Definition:</b> cached-powers.h:43</div></div>
<div class="ttc" id="classdouble__conversion_1_1_powers_of_ten_cache_html_aaf9667534da2d5439e04748010e357ab"><div class="ttname"><a href="classdouble__conversion_1_1_powers_of_ten_cache.html#aaf9667534da2d5439e04748010e357ab">double_conversion::PowersOfTenCache::GetCachedPowerForDecimalExponent</a></div><div class="ttdeci">static void GetCachedPowerForDecimalExponent(int requested_exponent, DiyFp *power, int *found_exponent)</div></div>
<div class="ttc" id="classdouble__conversion_1_1_powers_of_ten_cache_html_a3ecbb3a97d25287eabbff08d104aebf8"><div class="ttname"><a href="classdouble__conversion_1_1_powers_of_ten_cache.html#a3ecbb3a97d25287eabbff08d104aebf8">double_conversion::PowersOfTenCache::kDecimalExponentDistance</a></div><div class="ttdeci">static const int kDecimalExponentDistance</div><div class="ttdef"><b>Definition:</b> cached-powers.h:40</div></div>
<div class="ttc" id="classdouble__conversion_1_1_powers_of_ten_cache_html"><div class="ttname"><a href="classdouble__conversion_1_1_powers_of_ten_cache.html">double_conversion::PowersOfTenCache</a></div><div class="ttdef"><b>Definition:</b> cached-powers.h:35</div></div>
<div class="ttc" id="diy-fp_8h_html"><div class="ttname"><a href="diy-fp_8h.html">diy-fp.h</a></div></div>
<div class="ttc" id="classdouble__conversion_1_1_powers_of_ten_cache_html_a57195696e2342fcbc36f4fbbd4f21207"><div class="ttname"><a href="classdouble__conversion_1_1_powers_of_ten_cache.html#a57195696e2342fcbc36f4fbbd4f21207">double_conversion::PowersOfTenCache::kMinDecimalExponent</a></div><div class="ttdeci">static const int kMinDecimalExponent</div><div class="ttdef"><b>Definition:</b> cached-powers.h:42</div></div>
<div class="ttc" id="namespacedouble__conversion_html"><div class="ttname"><a href="namespacedouble__conversion.html">double_conversion</a></div><div class="ttdef"><b>Definition:</b> bignum-dtoa.h:33</div></div>
<div class="ttc" id="classdouble__conversion_1_1_powers_of_ten_cache_html_a5cdcb238a9b7615f550dd78d616b3c2e"><div class="ttname"><a href="classdouble__conversion_1_1_powers_of_ten_cache.html#a5cdcb238a9b7615f550dd78d616b3c2e">double_conversion::PowersOfTenCache::GetCachedPowerForBinaryExponentRange</a></div><div class="ttdeci">static void GetCachedPowerForBinaryExponentRange(int min_exponent, int max_exponent, DiyFp *power, int *decimal_exponent)</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Mar 18 2016 17:22:37 for XenC by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.11
</small></address>
</body>
</html>
